Jubilite: A 4-,8-connected Cubic Structural Pattern in Space Group Pm3
نویسندگان
چکیده
منابع مشابه
Jubilite: A 4-,8-connected Cubic Structural Pattern in Space Group Pm3
In the course of investigating structural modifications of the 3-,4-connected net known as the Pt3O4 structure-type (waserite), a novel 4-,8-connected structure-type was discovered. This lattice is generated by replacing the 3-connected trigonal planar vertices of the Pt3O4 structure-type with 4-connected tetrahedral vertices, to achieve a structure which possesses a generic empirical formula o...
متن کاملEvery cubic cage is quasi 4-connected
A (δ, g)-cage is a regular graph of degree δ and girth g with the least possible number of vertices. It was proved by Fu, Huang and Rodger that every (3, g)-cage is 3-connected. Moreover, the same authors conjectured that all (δ, g)-cages are δ-connected for every δ ≥ 3. As a first step towards the proof of this conjecture, Jiang and Mubayi showed that every (δ, g)-cage with δ ≥ 3 is 3-connecte...
متن کاملFinite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملA Cubic Curve Connected with Two Triangles
/ = /i$i. Since (to)i = 5ii is in (s), and ni is prime to the order of Si, Si is a power of s. Thus h, as well as t, corresponds to t in the isomorphism of G with G/(s) ; but h and /' are of the same order tii. Every element of G/(s) whose order is a divisor of m/mi corresponds to an element of G whose order is a divisor of m. It follows that t', and hence every element of G/(s) whose order div...
متن کاملCyclically five-connected cubic graphs
A cubic graph G is cyclically 5-connected if G is simple, 3–connected, has at least 10 vertices and for every set F of edges of size at most four, at most one component of G\F contains circuits. We prove that if G and H are cyclically 5-connected cubic graphs and H topologically contains G, then either G and H are isomorphic, or (modulo well-described exceptions) there exists a cyclically 5-con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Molecular Sciences
سال: 2005
ISSN: 1422-0067
DOI: 10.3390/i6030177